Finding Perfect Matchings in Bipartite Hypergraphs
نویسندگان
چکیده
منابع مشابه
Finding Perfect Matchings in Bipartite Hypergraphs
Haxell’s condition [Hax95] is a natural hypergraph analog of Hall’s condition, which is a wellknown necessary and sufficient condition for a bipartite graph to admit a perfect matching. That is, when Haxell’s condition holds it forces the existence of a perfect matching in the bipartite hypergraph. Unlike in graphs, however, there is no known polynomial time algorithm to find the hypergraph per...
متن کاملFinding all minimum-cost perfect matchings in Bipartite graphs
The Hungarian method is an e cient algorithm for nding a minimal cost perfect matching in a weighted bipartite graph. This paper describes an e cient algorithm for nding all minimal cost perfect matchings. The computational time required to generate each additional perfect matching is O(n(n + m)); and it requires O(n+m) memory storage. This problem can be solved by algorithms for nding the Kth-...
متن کاملFinding All The Perfect Matchings in Bipartite Graphs
|This paper describes an algorithm for nding all the perfect matchings in a bipartite graph. By using the binary partitioning method, our algorithm requires O(c(n+m) + n 2:5 ) computational e ort and O(nm) memory storage, (where n denotes the number of vertices, m denotes the number of edges, and c denotes the number of perfect matchings in the given bipartite graph). Keywords|bipartite graph, ...
متن کاملBipartite Graphs and Perfect Matchings
When we think about markets creating opportunities for interaction between buyers and sellers, there is an implicit network encoding the access between buyers and sellers. In fact, there are several ways to use networks to model buyer-seller interaction, and here we discuss some of them. First, consider the case in which not all buyers have access to all sellers. There could be several reasons ...
متن کاملNearly perfect matchings in regular simple hypergraphs
For every fixed k ≥ 3 there exists a constant ck with the following property. Let H be a kuniform, D-regular hypergraph on N vertices, in which no two edges contain more than one common vertex. If k > 3 then H contains a matching covering all vertices but at most ckND. If k = 3, then H contains a matching covering all vertices but at most c3ND lnD. This improves previous estimates and implies, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2017
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-017-3567-2